#include<vector>
using namespace std;
class MyCircularQueue {
private:
    int size = 0;
    vector<int> data;
    int begin = 0;
    int end = 0;
    int flag = false;
public:
    /** Initialize your data structure here. Set the size of the queue to be k. */
    MyCircularQueue(int k):size(k), data(k) {

    }

    /** Insert an element into the circular queue. Return true if the operation is successful. */
    bool enQueue(int value) {
        if (isFull()) return false;
        data[end] = value;
        end = (end + 1) % size;
        flag = true;
        return true;
    }

    /** Delete an element from the circular queue. Return true if the operation is successful. */
    bool deQueue() {
        if (isEmpty()) return false;
        begin = (begin + 1) % size;
        flag = false;
        return true;
    }

    /** Get the front item from the queue. */
    int Front() {
        if (isEmpty()) return -1;
        return data[begin];
    }

    /** Get the last item from the queue. */
    int Rear() {
        if (isEmpty()) return -1;
        int index = (end - 1 + size) % size;
        return data[index];
    }

    /** Checks whether the circular queue is empty or not. */
    bool isEmpty() {
        return !flag&&begin == end;
    }

    /** Checks whether the circular queue is full or not. */
    bool isFull() {
        return flag && begin == end;
    }
};

/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue* obj = new MyCircularQueue(k);
 * bool param_1 = obj->enQueue(value);
 * bool param_2 = obj->deQueue();
 * int param_3 = obj->Front();
 * int param_4 = obj->Rear();
 * bool param_5 = obj->isEmpty();
 * bool param_6 = obj->isFull();
 */